Graphs without large triangle free subgraphsBOLLOBAS, B; HIND, H. R.Discrete mathematics. 1991, Vol 87, Num 2, pp 119-131, issn 0012-365X, 13 p.Article

THÉORIE DE RAMSEY ET IDÉAUX SUR Pκ(Λ) = RAMSEY THEORY AND IDEALS ON P_κ(Λ)Péan, Cedric; Matet, Pierre.1998, 133 p.Thesis

Consistency for partition regular equationsLEADER, Imre; RUSSELL, Paul A.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 847-850, issn 0012-365X, 4 p.Article

A note on the size-Ramsey number of long subdivisions of graphsDONADELLI, Jair; HAXELL, Penny E; KOHAYAKAWA, Yoshiharu et al.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 1, pp 191-206, issn 0988-3754, 16 p.Article

On a Ramsey-theoretic property of ordersGROLMUSZ, V.Journal of combinatorial theory. Series A. 1992, Vol 61, Num 2, pp 243-251, issn 0097-3165Article

Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbersBROWN, J. I; HOSHINO, R.Discrete mathematics. 2009, Vol 309, Num 8, pp 2223-2232, issn 0012-365X, 10 p.Article

On multiplicative bases in commutative semigroupsPUS, V.European journal of combinatorics. 1992, Vol 13, Num 3, pp 201-211, issn 0195-6698Article

POLYCHROMATIC COLORINGS OF SUBCUBES OF THE HYPERCUBEOFFNER, David.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 2, pp 450-454, issn 0895-4801, 5 p.Article

Implicit O(1) probe searchAMOS FIAT; MONI NAOR.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 1-10, issn 0097-5397Article

Ramsey properties of random graphsLUCZAK, T; RUCINSKI, A; VOGT, B et al.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 1, pp 55-68, issn 0095-8956Article

Monochromatic solutions to equations with unit fractionsBROWN, T. C; RÖDL, V.Bulletin of the Australian Mathematical Society. 1991, Vol 43, Num 3, pp 387-392, issn 0004-9727Article

A TWO-SET PROBLEM ON COLORING THE INTEGERSRYAN, Jeffrey A.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 3, pp 731-736, issn 0895-4801, 6 p.Article

AVOIDING MONOCHROMATIC SEQUENCES WITH SPECIAL GAPSLANDMARK, Bruce M; ROBERTSON, Aaron.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 3, pp 794-801, issn 0895-4801, 8 p.Article

Ramsey ultrafilters and the reaping number-Con (r<u)GOLDSTERN, H; SHELAH, S.Annals of pure and applied logic. 1990, Vol 49, Num 2, pp 121-142, issn 0168-0072, 22 p.Article

Monochromatic simplices of any volumeDUMITRESCU, Adrian; MINGHUI JIANG.Discrete mathematics. 2010, Vol 310, Num 4, pp 956-960, issn 0012-365X, 5 p.Article

Iterated combinatorial density theoremsFRANKL, P; GRAHAM, R. L; ROÊDL, V et al.Journal of combinatorial theory. Series A. 1990, Vol 54, Num 1, pp 95-111, issn 0097-3165Article

Transversals of vertex partitions in graphsFELLOWS, M. R.SIAM journal on discrete mathematics. 1990, Vol 3, Num 2, pp 206-215, 10 p.Article

A partition problem on colored setsNAKAMIGAWA, Tomoki.Discrete mathematics. 2003, Vol 265, Num 1-3, pp 405-410, issn 0012-365X, 6 p.Article

Image partition regularity near zeroDE, Dibyendu; HINDMAN, Neil.Discrete mathematics. 2009, Vol 309, Num 10, pp 3219-3232, issn 0012-365X, 14 p.Article

A finite goal set in the plane which is not a winnerPEGDEN, Wesley.Discrete mathematics. 2008, Vol 308, Num 24, pp 6546-6551, issn 0012-365X, 6 p.Article

Unavoidable subgraphs of colored graphsCUTLER, Jonathan; MONTAGH, Balazs.Discrete mathematics. 2008, Vol 308, Num 19, pp 4396-4413, issn 0012-365X, 18 p.Conference Paper

The complexity of parallel sortingMEYER AUF DER HEIDE, F; WIGDERSON, A.SIAM journal on computing (Print). 1987, Vol 16, Num 1, pp 100-107, issn 0097-5397Article

A polynomial-time algorithm for finding zero-sumsDEL LUNGE, Alberto; MARINI, Claudio; MORI, Elisa et al.Discrete mathematics. 2009, Vol 309, Num 9, pp 2658-2662, issn 0012-365X, 5 p.Article

Page / 2